Hamilton-chain saturated hypergraphsDUDEK, Aneta; ZAK, Andrzej; KATONA, Gyula Y et al.Discrete mathematics. 2010, Vol 310, Num 6-7, pp 1172-1176, issn 0012-365X, 5 p.Article

On spanning connected graphsLIN, Cheng-Kuan; HUANG, Hua-Min; TAN, Jimmy J. M et al.Discrete mathematics. 2008, Vol 308, Num 7, pp 1330-1333, issn 0012-365X, 4 p.Article

The structure of alternating-Hamiltonian matricesWATERHOUSE, William C.Linear algebra and its applications. 2005, Vol 396, pp 385-390, issn 0024-3795, 6 p.Article

On a certain class of linear hamiltonian mapsOTSUKI, Nobukazu; SUZUKI, Sintaro.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 12, pp 3637-3644, issn 0002-9939, 8 p.Article

Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic NetworksHO, Tung-Yang; LIN, Cheng-Kuan.Journal of information science and engineering. 2009, Vol 25, Num 6, pp 1855-1862, issn 1016-2364, 8 p.Article

Panpositionable hamiltonicity of the alternating group graphsTENG, Yuan-Hsiang; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Networks (New York, NY). 2007, Vol 50, Num 2, pp 146-156, issn 0028-3045, 11 p.Article

The Spanning Connectivity of the Burnt Pancake GraphsCHIN, Cherng; WENG, Tien-Hsiung; HSU, Lih-Hsing et al.IEICE transactions on information and systems. 2009, Vol 92, Num 3, pp 389-400, issn 0916-8532, 12 p.Article

On mutually independent hamiltonian pathsTENG, Yuan-Hsiang; TAN, Jimmy J. M; HO, Tung-Yang et al.Applied mathematics letters. 2006, Vol 19, Num 4, pp 345-350, issn 0893-9659, 6 p.Article

The super connectivity of the pancake graphs and the super laceability of the star graphsLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, Lih-Hsing et al.Theoretical computer science. 2005, Vol 339, Num 2-3, pp 257-271, issn 0304-3975, 15 p.Article

SC-HAMILTONICITY AND ITS LINKAGES WITH STRONG HAMILTONICITY OF A GRAPHBENVENUTI, Daniel K; PUNNEN, Abraham P.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2035-2041, issn 0895-4801, 7 p.Article

Mutually orthogonal hamiltonian connected graphsHO, Tung-Yang; LIN, Cheng-Kuan; TAN, Jimmy J. M et al.Applied mathematics letters. 2009, Vol 22, Num 9, pp 1429-1431, issn 0893-9659, 3 p.Article

Forbidden subgraphs that imply 2-factorsFAUDREE, J. R; FAUDREE, R. J; RYJACEK, Z et al.Discrete mathematics. 2008, Vol 308, Num 9, pp 1571-1582, issn 0012-365X, 12 p.Article

Cubic planar hamiltonian graphs of various typesKAO, Shin-Shin; HSU, Kung-Ming; HSU, Lih-Hsing et al.Discrete mathematics. 2006, Vol 306, Num 13, pp 1364-1389, issn 0012-365X, 26 p.Article

The spanning connectivity of line graphsHUANG, Po-Yi; HSU, Lih-Hsing.Applied mathematics letters. 2011, Vol 24, Num 9, pp 1614-1617, issn 0893-9659, 4 p.Article

Achievable Casimirs and its implications on control of port-Hamiltonian systemsPASUMARTHY, R; VAN DER SCHAFT, A. J.International Journal of Control. 2007, Vol 80, Num 9, pp 1421-1438, issn 0020-7179, 18 p.Article

A degree condition implying that every matching is contained in a hamiltonian cycleAMAR, Denise; FLANDRIN, Evelyne; GANCARZEWICZ, Grzegorz et al.Discrete mathematics. 2009, Vol 309, Num 11, pp 3703-3713, issn 0012-365X, 11 p.Article

Removable matchings and hamiltonian cyclesZHIQUAN HU; HAO LI.Discrete mathematics. 2009, Vol 309, Num 5, pp 1020-1024, issn 0012-365X, 5 p.Conference Paper

Discrete port-Hamiltonian systemsTALASILA, V; CLEMENTE-GALLARDO, J; VAN DER SCHAFT, A. J et al.Systems & control letters. 2006, Vol 55, Num 6, pp 478-486, issn 0167-6911, 9 p.Article

Networks of Hamiltonian systems and feedbackBELABBAS, M.-A.Systems & control letters. 2009, Vol 58, Num 3, pp 217-224, issn 0167-6911, 8 p.Article

Graph powers and k-ordered HamiltonicityCHEBIKIN, Denis.Discrete mathematics. 2008, Vol 308, Num 15, pp 3220-3229, issn 0012-365X, 10 p.Article

On Hamiltonian cycles and Hamiltonian pathsSOHEL RAHMAN, M; KAYKOBAD, M.Information processing letters. 2005, Vol 94, Num 1, pp 37-41, issn 0020-0190, 5 p.Article

The super spanning connectivity and super spanning laceability of the enhanced hypercubesCHANG, Chung-Hao; LIN, Cheng-Kuan; TAN, Jimmy J. M et al.Journal of supercomputing. 2009, Vol 48, Num 1, pp 66-87, issn 0920-8542, 22 p.Article

On cubic 2-independent Hamiltonian connected graphsHO, Tung-Yang; HUNG, Chun-Nan; HSU, Lih-Hsing et al.Journal of combinatorial optimization. 2007, Vol 14, Num 2-3, pp 275-294, issn 1382-6905, 20 p.Conference Paper

A new sufficient condition for Hamiltonicity of graphsRAO LI.Information processing letters. 2006, Vol 98, Num 4, pp 159-161, issn 0020-0190, 3 p.Article

Hamiltonian decompositions of complete k-uniform hypergraphsBAILEY, Robert F; STEVENS, Brett.Discrete mathematics. 2010, Vol 310, Num 22, pp 3088-3095, issn 0012-365X, 8 p.Conference Paper